Survey on various Classes of Picture Languages
نویسنده
چکیده
A formal language is defined as a set of strings of an alphabet which is a non-empty set. In terms of pictures, a set of pictures are called as picture language in the field of formal languages. The study of picture languages was originally prompted by the problems of image processing and pattern recognition. The matrix grammar and tiling systems have been designed to describe the picture languages. Many problems in picture languages have been formulated from one dimensional formal language theory. A method of undecidability results for regular picture languages is used to show the undecidability of the equivalence problem in regular languages Jurgen; Friedhelm (1993). The methods of mathematical linguistics have been considered for picture generation and picture description. Generally mathematical linguistics deals with strings and not with pictures. Picture language is not recognizable and also proved that this type language is both star free and piecewise testable Rosenfeld (1970).
منابع مشابه
Task Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملThe Effect of Different Task Types on Learning Prepositions in Form–Focused and Meaning–Focused Interaction Enhancement-Based Classes
The current study examines the impact of different task types on learning prepositions in form and meaning- focused interaction enhancement- based classes. The participants were 57 second Year University students enrolled in three intact lab classes at Tabriz Islamic Azad University. The first group was provided with form-focused interaction enhancement, the second with the meaning-focused int...
متن کاملWeb Grammars
Classes of "phrase-structure grammars" are defined whose "languages" consist, not of strings of symbols, but of directed graphs with symbols at their vertices ("webs"). Examples of such "web grammars" are given, having languages consisting of trees, of two-terminal series-parallel networks, and of "triangular" networks. It is shown that if the graphs permitted in a "context-sensitive" web gramm...
متن کاملOgden’s Lemma for Random Permitting and Forbidding Context Picture Languages and Table-Driven Context-Free Picture Languages
Random context picture grammars are used to generate pictures through successive refinement. There are three important subclasses of random context picture grammars, namely random permitting context picture grammars, random forbidding context picture grammars and table-driven context-free picture grammars. These grammars generate the random permitting context picture languages, random forbiddin...
متن کاملDescriptive complexity for pictures languages
This paper deals with logical characterizations of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: the class of recognizable picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages...
متن کامل